CLUSTERING A DATA ARRAY AND THE TRAVELING-SALESMAN PROBLEM.LENSTRA JK.1974; OPER. RES.; U.S.A.; DA. 1974; VOL. 22; NO 2; PP. 413-414; BIBL. 5 REF.Article

SOME SIMPLE APPLICATIONS OF THE TRAVELLING SALESMAN PROBLEM.LENSTRA JK; RINNOOY KAN AHG.1975; OPER. RES. QUART.; G.B.; DA. 1975; VOL. 26; NO 4; PP. 717-733; BIBL. 1 P. 1/2Article

COMPLEXITY OF VEHICLE ROUTING AND SCHEDULING PROBLEMSLENSTRA JK; RINNOOY KAN AHG.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 2; PP. 221-227; BIBL. 34 REF.Conference Paper

COMPLEXITY RESULTS FOR SCHEDULING CHAINS ON A SINGLE MACHINELENSTRA JK; RINNKOOY KAN AHG.1980; EUROP. J. OPERAT. RES.; NLD; DA. 1980; VOL. 4; NO 4; PP. 270-275; BIBL. 19 REF.Conference Paper

COMPUTATIONAL COMPLEXITY OF DISCRETE OPTIMIZATION PROBLEMSLENSTRA JK; RINNOOY KAN AHG.1979; DISCRETE OPTIMIZATION. ADVANCED RESEARCH INSTITUTE ON DISCRETE OPTIMIZATION AND SYSTEMS APPLICATIONS. DISCRETE OPTIMIZATION SYMPOSIUM/1977/BANFF ALBERTA-VANCOUVER B. C.; NLD/USA/GBR; AMSTERDAM: NORTH-HOLLAND/NEW YORK: NORTH-HOLLAND/OXFORD: NORTH-HOLLAND; DA. 1979; VOL. 1; PP. 121-140; BIBL. 57 REF.Conference Paper

COMPLEXITY OF SCHEDULING UNDER PRECEDENCE CONSTRAINTS.LENSTRA JK; RINNOOY KAN AHG.1978; OPER. RES.; U.S.A.; DA. 1978; VOL. 26; NO 1; PP. 22-35; BIBL. 2 P.Article

A CHARACTERIZATION OF LINEAR ADMISSIBLE TRANSFORMATIONS OF THE M-TRAVELLING SALESMEN PROBLEM: A RESULT OF BERENGUERLENSTRA JK; RINNOOY KAN AHG.1979; EUROP. J. OPERAT. RES.; NLD; DA. 1979; VOL. 3; NO 3; PP. 250-252; BIBL. 7 REF.Article

ON THE EXPECTED PERFORMANCE OF BRANCH-AND-BOUND ALGORITHMS.LENSTRA JK; RINNOOY KAN AHG.1978; OPER. RES.; USA; DA. 1978; VOL. 26; NO 2; PP. 347-349; BIBL. 4 REF.Article

A GENERAL BOUNDING SCHEME FOR THE PERMUTATION FLOW-SHOP PROBLEM.LAGEWEG BJ; LENSTRA JK; RINNOOY KAN AHG et al.1978; OPER. RES.; U.S.A.; DA. 1978; VOL. 26; NO 1; PP. 53-67; BIBL. 1 P. 1/2Article

MINIMIZING TOTAL COSTS IN ONE-MACHINE SCHEDULING.KAN AHGR; LAGEWEG BJ; LENSTRA JK et al.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 5; PP. 908-927; BIBL. 1 P.Article

COMPLEXITY RESULTS FOR SCHEDULING TASKS IN FIXED INTERVALS ON TWO TYPES OF MACHINESNAKAJIMA K; HAKIMI SL; LENSTRA JK et al.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 3; PP. 512-520; BIBL. 17 REF.Article

MINIMIZING MAXIMUM LATENESS IN A TWO-MACHINE OPEN SHOPLAWLER EL; LENSTRA JK; RINNOOY KAN AHG et al.1981; MATH. OPER. RES.; ISSN 0364-765X; USA; DA. 1981; VOL. 6; NO 1; PP. 153-158; BIBL. 8 REF.Article

THE COMPLEXITY OF THE NETWORK DESIGN PROBLEMJOHNSON DS; LENSTRA JK; RINNOOY KAN AHG et al.1978; NETWORKS; USA; DA. 1978; VOL. 8; NO 4; PP. 279-285; BIBL. 10 REF.Article

MINIMIZING TOTAL COSTS IN ONE-MACHINE SCHEDULING.KAN AHGR; LAGEWEG BJ; LENSTRA JK et al.1975; IN: COMB. PROGRAMM. METHODS APPL. PROC. NATO ADV. STUDY INST.; VERSAILLES; 1974; DORDRECHT; D. REIDEL; DA. 1975; PP. 343-350; BIBL. 14 REF.Conference Paper

JOB-SHOP SCHEDULING BY IMPLICIT ENUMERATIONLAGEWEG BJ; LENSTRA JK; RINNOOY KAN AHG et al.1977; MANAG. SCI.; USA; DA. 1977; VOL. 24; NO 4; PP. 441-450; ABS. 41 REF.Article

BRANCHING FROM THE LARGEST UPPER BOUND. FOLKLORE AND FACTS.FOX BL; LENSTRA JK; RINNOOYKAN AHG et al.1978; EUROP. J. OPERAT. RES.; NLD; DA. 1978; VOL. 2; NO 3; PP. 191-194; BIBL. 9 REF.Article

SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS: CLASSIFICATION AND COMPLEXITYBLAZEWICZ J; LENSTRA JK; RINNOOY KAN AHG et al.1983; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1983; VOL. 5; NO 1; PP. 11-24; BIBL. 13 REF.Conference Paper

COMPUTER-AIDED COMPLEXITY CLASSIFICATION OF COMBINATORIAL PROBLEMSLAGEWEG BJ; LENSTRA JK; LAWLER EL et al.1982; COMMUNICATIONS OF THE A.C.M.; ISSN 0001-0782; USA; DA. 1982; VOL. 25; NO 11; PP. 817-822; BIBL. 21 REF.Article

TWO LINES LEAST SQUARESLENSTRA AK; LENSTRA JK; RINNOOY KAN AHG et al.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 66; PP. 201-211; BIBL. 14 REF.Conference Paper

SURROGATE DUALITY RELAXATION FOR JOB SHOP SCHEDULINGFISHER ML; LAGEWEG BJ; LENSTRA JK et al.1983; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1983; VOL. 5; NO 1; PP. 65-75; BIBL. 34 REF.Conference Paper

AN APPRAISAL OF COMPUTATIONAL COMPLEXITY FOR OPERATIONS RESEARCHERS = UNE EVALUATION DE LA COMPLEXICITE DE CALCUL POUR LES CHERCHEURS DE RECHERCHE OPERATIONNELLELENSTRA JK; RINNOOY KAN AHG; VAN EMDE BOAS P et al.1982; EUR. J. OPER. RES.; ISSN 0377-2217; NLD; DA. 1982; VOL. 11; NO 3; PP. 201-210; BIBL. 64 REF.Article

OPTIMIZATION AND APPROXIMATION IN DETERMINISTIC SEQUENCING AND SCHEDULING: A SURVEYGRAHAM RL; LAWLER EL; LENSTRA JK et al.1979; DISCRETE OPTIMIZATION. ADVANCED RESEARCH INSTITUTE ON DISCRETE OPTIMIZATION AND SYSTEMS APPLICATIONS. DISCRETE OPTIMIZATION SYMPOSIUM/1977/BANFF ALBERTA-VANCOUVER B. C.; NLD/USA/GBR; AMSTERDAM: NORTH-HOLLAND/NEW YORK: NORTH-HOLLAND/OXFORD: NORTH-HOLLAND; DA. 1979; VOL. 2; PP. 287-326; BIBL. 6 P.Conference Paper

ANALYTICAL EVALUATION OF HIERARCHICAL PLANNING SYSTEMSDEMPSTER MAH; FISHER ML; JANSEN L et al.1981; OPER. RES.; ISSN 0030-364X; USA; DA. 1981; VOL. 29; NO 4; PP. 707-716; BIBL. 16 REF.Article